Evenly distributed subsets ofSnand a combinatorial application

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On hypergraphs having evenly distributed subhypergraphs

Chung, F.R.K. and R.L. Graham, On hypergraphs having evenly distributed subhypergraphs, Discrete Mathematics 111 (1993) 125-129.

متن کامل

Evenly Distributed Depth is the Worst for Distributed Snooping

In the purely object-parallel approach to multiprocessor rendering, each processor is assigned responsibility to render a subset of the graphics database. When rendering is complete, pixels from the processors must be merged and globally z-bu ered. On an arbitrary multiprocessor interconnection network, the straightforward algorithm for pixel merging requires dA total network bandwidth per fram...

متن کامل

Quantifying evenly distributed states in exclusion and nonexclusion processes.

Spatial-point data sets, generated from a wide range of physical systems and mathematical models, can be analyzed by counting the number of objects in equally sized bins. We find that the bin counts are related to the Pólya distribution. New measures are developed which indicate whether or not a spatial data set, generated from an exclusion process, is at its most evenly distributed state, the ...

متن کامل

A combinatorial characterization of second category subsets of the

We prove that S ⊆ {0, 1} is of second category if and only if for each f : ω → ⋃ n∈ω{0, 1} n there exists a sequence {an}n∈ω belonging to S such that for infinitely many i ∈ ω the infinite sequence {ai+n}n∈ω extends the finite sequence f(i). Let M denote the ideal of first category subsets of R. Let M({0, 1}) denote the ideal of first category subsets of the Cantor discontinuum {0, 1}. Obviousl...

متن کامل

Distributed Combinatorial Optimization

This paper reports about research projects of the University of Paderborn in the eld of distributed combinatorial optimization. We give an introduction into combinatorial optimization and a brief deenition of some important applications. As a rst exact solution method we describe branch & bound and present the results of our work on its distributed implementation. Results of our distributed imp...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Pacific Journal of Mathematics

سال: 1982

ISSN: 0030-8730,0030-8730

DOI: 10.2140/pjm.1982.98.323